Ramification of Klein coverings
نویسندگان
چکیده
منابع مشابه
Nondegeneracy of Coverings of Minimal Tori and Klein Bottles in Riemannian Manifolds
We say that a parametrized minimal torus or Klein bottle in a ambient Riemannian manifold M is Morse nondegenerate if it lies on a nondegenerate critical submanifold, which is also an orbit for the group of isometries of the flat metric of total area one. This article shows that for generic choice of Riemannian metric on a compact manifold M of dimension at least four, unbranched multiple cover...
متن کاملOn category of co-coverings
In this article, we introduce the concept of co-covering which is the dual of covering concept. Then, we prove several theorems being similar to the theorems that have been de-veloped for the covering concept. For example, we provide the lifting criterion for co-coverings of a topological space X, which helps us to classify them by subgroups of the group of all homeomorphisms of X.
متن کاملRamification of stream networks.
The geometric complexity of stream networks has been a source of fascination for centuries. However, a comprehensive understanding of ramification--the mechanism of branching by which such networks grow--remains elusive. Here we show that streams incised by groundwater seepage branch at a characteristic angle of 2π/5 = 72°. Our theory represents streams as a collection of paths growing and bifu...
متن کاملRamification of rough paths
The stack of iterated integrals of a path is embedded in a larger algebraic structure where iterated integrals are indexed by decorated rooted trees and where an extended Chen’s multiplicative property involves the Dürr-Connes-Kreimer coproduct on rooted trees. This turns out to be the natural setting for a non-geometric theory of rough paths. MSC: 60H99; 65L99
متن کاملFractional Coverings, Greedy Coverings, and Rectifier Networks
A rectifier network is a directed acyclic graph with distinguished sources and sinks; it is said to compute a Boolean matrix M that has a 1 in the entry (i, j) iff there is a path from the jth source to the ith sink. The smallest number of edges in a rectifier network that computes M is a classic complexity measure on matrices, which has been studied for more than half a century. We explore two...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales Academiae Scientiarum Fennicae. Series A. I. Mathematica
سال: 1985
ISSN: 0066-1953
DOI: 10.5186/aasfm.1985.1007